Vertex-symmetric digraphs with small diameter
نویسندگان
چکیده
منابع مشابه
Vertex-symmetric Digraphs with Small Diameter
There is increasing interest in the design of dense vertex-symmetric graphs and digraphs as models of interconnection networks for implementing parallelism. In these systems many nodes are connected with relatively few links and short paths between them and each node may execute, without modifications, the same communication software. In this paper we give new families of dense vertex-symmetric...
متن کاملTranspose on vertex symmetric digraphs
In [2] (and earlier in [3]), we defined several global communication tasks (universal exchange, universal broadcast, universal summation) on directed or vertex symmetric networks. In that paper, we mainly focused on universal broadcast. In [4], we discussed universal sum. Here we continue this work and focus on universal exchange (transpose) in directed vertex symmetric graphs. Introduction. In...
متن کاملThe number of digraphs with small diameter
k) denote the l1um ber of of order nand diam-In this paper it is that: fixed k :~, ii) for every fixed k 1, n! where with D(n;d=n k:):Sn! (n) are polynomials of degree k 1 in n coefficients depending only on k. c;o:rres1)(:m(img results for undirected graphs given in [2]. of a vertex :r is the number of vertices of CJ that nr1PO'l'PP d-(x) is the number of vertices of G ~UII~~'~HU connected dig...
متن کاملOn Large Vertex Symmetric 2-Reachable Digraphs
We are interested in the construction of the largest possible vertex symmetric digraphs with the property that between any two vertices there is a walk of length two (that is, they are 2-reachable). Other than a theoretical interest, these digraphs and their generalizations may be used as models of interconnection networks for implementing parallelism. In these systems many nodes are connected ...
متن کاملRemoving edges from hypercubes to obtain vertex-symmetric networks with small diameter
The binary hypercube Qn has small diameter, but a relatively large number of links. Because of this, efforts have been made to determine the maximum number of links that can be deleted without increasing the diameter. However, the resulting networks are not vertex-symmetric. We propose a family of vertex-symmetric spanning subnetworks of Qn, whose diameter differs from that of Qn by only a smal...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1995
ISSN: 0166-218X
DOI: 10.1016/0166-218x(93)e0145-o